State complexity of combined operations with two basic operations
نویسندگان
چکیده
منابع مشابه
State complexity of combined operations with two basic operations
This paper studies the state complexity of (L1L2) , L1 L2, L ∗ 1L2, (L1 ∪L2)L3, (L1∩L2)L3, L1L2∩L3, and L1L2∪L3 for regular languages L1, L2, and L3. We first show that the upper bound proposed by [Liu, Martin-Vide, Salomaa, Yu, 2008] for the state complexity of (L1L2) R coincides with the lower bound and is thus the state complexity of this combined operation by providing some witness DFAs. Al...
متن کاملState complexity of basic language operations combined with reversal
Article history: Received 1 July 2007 Revised 19 February 2008 Available online 7 June 2008
متن کاملState complexity of combined operations
We study the state complexity of combined operations. Two particular combined operations are studied: star of union and star of intersection. It is shown that the state complexity of a combined operation is not necessarily similar to the combination of the individual state complexities of the participating operations. c © 2007 Elsevier B.V. All rights reserved.
متن کاملState complexity of catenation combined with boolean operations
We exhaustively investigate possible combinations of a boolean operation together with a catenation. In many cases we prove and improve some conjectures by Brzozowski. For each family of operation, we endeavour to provide a common witness with a small size alphabet.
متن کاملUniversal Witnesses for State Complexity of Basic Operations Combined with Reversal
We study the state complexity of boolean operations, concatenation, and star, with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric differences and differences of such languages. We prove that the previously discovered bounds for union, intersection, concatenation and star of such languages can all be met by the recently introduced universal witness ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.02.030